1,073 research outputs found
Recommended from our members
Example-based video color grading
In most professional cinema productions, the color palette of the movie is painstakingly adjusted by a team of skilled colorists -- through a process referred to as color grading -- to achieve a certain visual look. The time and expertise required to grade a video makes it difficult for amateurs to manipulate the colors of their own video clips. In this work, we present a method that allows a user to transfer the color palette of a model video clip to their own video sequence. We estimate a per-frame color transform that maps the color distributions in the input video sequence to that of the model video clip. Applying this transformation naively leads to artifacts such as bleeding and flickering. Instead, we propose a novel differential-geometry-based scheme that interpolates these transformations in a manner that minimizes their curvature, similarly to curvature flows. In addition, we automatically determine a set of keyframes that best represent this interpolated transformation curve, and can be used subsequently, to manually refine the color grade. We show how our method can successfully transfer color palettes between videos for a range of visual styles and a number of input video clips.Engineering and Applied Science
Propagation des contraintes tables souples Etude pr eliminaire
National audienceWCSP is a framework that has attracted a lot of at- tention during the last decade. In particular, there have been many developments of ltering approaches based on the concept of soft local consistencies such as node consistency (NC), arc consistency (AC), full directio- nal arc consistency (FDAC), existential directional arc consistency (EDAC), virtual arc consistency (VAC) and optimal soft arc consistency (OSAC). Almost all algo- rithms related to these properties have been introduced for binary weighted constraint networks, and most of the conducted experiments typically include constraint networks involving only binary and ternary constraints. In this paper, we focus on extensional soft constraints of large arity. We propose an algorithm to lter such constraints and embed it in PFC-MRDAC.Durant ces dix derni ères ann ées, de nombreuses études ont ét és r éalis ées pour le cadre WCSP (Weighted Constraint Satisfaction Problem). En particulier, ont ét é propos ées de nombreuses techniques de filtrage bas ées sur le concept de coh érence locale souple telle que la co- h érence de n oeud, et surtout la coh érence d'arc souple. Toutefois, la plupart de ces algorithmes ont ét és intro- duits pour le cas des contraintes binaires, et la plupart des exp érimentations ont ét és men ées sur des r éseaux de contraintes comportant uniquement des contraintes binaires et/ou ternaires. Dans cet article, nous nous in- t eressons aux contraintes tables souples de grande arit é. Nous proposons un premier algorithme pour filtrer ces contraintes et nous l'int égrons a PFC-MRDAC
- …